Constraint propagation techniques for the disjunctive scheduling problem
نویسندگان
چکیده
منابع مشابه
Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling
Edge-finding bounding techniques are particular constraint propagation techniques which reason about the order in which several activities can execute on a given resource. The aim of the following paper is to provide a rather comprehensive (although necessarily incomplete) review of existing edge-finding algorithms. The simplest case of non-preemptive disjunctive scheduling is reviewed first, f...
متن کاملA Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling
Disjunctive constraints are widely used to ensure that the time intervals over which two activities require the same resource cannot overlap: if a resource is required by two activities A and B, the disjunctive constraint states that either A precedes B or B precedes A. The \propagation" of disjunctive constraints consists in determining cases where only one of the two orderings is feasible. It...
متن کاملMDD Propagation for Disjunctive Scheduling
Disjunctive scheduling is the problem of scheduling activities that must not overlap in time. Constraint-based techniques, such as edge finding and not-first/not-last rules, have been a key element in successfully tackling large and complex disjunctive scheduling problems in recent years. In this work we investigate new propagation methods based on limited-width Multivalued Decision Diagrams (M...
متن کاملBacktracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows (i.e. earliest/latest possible start time windows). This problem is a well-known NP-complete Constraint Satisfaction Problem (CSP). A popular method for solving this type of problems involves using depth-first backtrack search. In our earlier work, we f...
متن کاملGeneralized disjunctive constraint propagation for solving the job shop problem with time lags
In this paper we propose new insights based on an insertion heuristic and generalized resource constraint propagation for solving the job shop scheduling problem with minimum and maximum time-lags. To show the contribution of our propositions we propose a branch-and-bound algorithm and provide an experimental study. The results obtained conclude that our heuristic obtains feasible schedules wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2000
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(00)00040-0